منابع مشابه
Characteristic Polynomials of Skew-Adjacency Matrices of Oriented Graphs
An oriented graph Gσ is a simple undirected graph G with an orientation, which assigns to each edge a direction so that Gσ becomes a directed graph. G is called the underlying graph of Gσ and we denote by S(Gσ) the skew-adjacency matrix of Gσ and its spectrum Sp(Gσ) is called the skew-spectrum of Gσ. In this paper, the coefficients of the characteristic polynomial of the skew-adjacency matrix S...
متن کاملdeterminants of adjacency matrices of graphs
we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...
متن کاملCommutativity of the adjacency matrices of graphs
We say that two graphs G1 and G2 with the same vertex set commute if their adjacency matrices commute. In this paper, we find all integers n such that the complete bipartite graph Kn, n is decomposable into commuting perfect matchings or commuting Hamilton cycles. We show that there are at most n−1 linearly independent commuting adjacency matrices of size n; and if this bound occurs, then there...
متن کاملDeterminants of Adjacency Matrices of Graphs
Let G be a simple graph with finite number of vertices. We denote by det(G) the determinant of an adjacency matrix of G. This number det(G) is an integer and is an invariant of G so that its value is independent of the choice of vertices in an adjacency matrix. In this paper, we study the distributions of det(G) whenever G runs over graphs with finite n vertices for a given integer n ≥ 1. We de...
متن کاملNilpotent Adjacency Matrices and Random Graphs
While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotentgenerated algebra, a “new” adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting Xk denote the number of k-cycles occurring in a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2012
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.01.019